Recognizing linear structure in noisy matrices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognizing Weakly Stable Matrices

A max-plus matrixA is called weakly stable if the sequence (orbit) x,A⊗x, A2⊗x, . . . does not reach an eigenvector of A for any x unless x is an eigenvector. This is in contrast to previously studied strongly stable (robust) matrices for which the orbit reaches an eigenvector with any nontrivial starting vector. Max-plus matrices are used to describe multiprocessor interactive systems for whic...

متن کامل

Recognizing Balanceable Matrices

A 0/ ± 1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entries per row and per column in which the sum of all entries is 2 modulo 4. A 0/1 matrix is balanceable if its nonzero entries can be signed ±1 so that the resulting matrix is balanced. A signing algorithm due to Camion shows that the problems of recognizing balanced 0/ ± 1 matrices and balanceable ...

متن کامل

Recognizing spatial patterns: a noisy exemplar approach

Models of categorization typically rely on the use of stimuli composed of well-defined dimensions (e.g., Ashby & Maddox (1998) in Choice, decision, and measurement: Essays in honor of R. Duncan Luce, p. 251-301, Mahwah, NJ: Erlbaum). We apply a similar approach to the analysis of recognition memory. Using a version of short-term recognition paradigm (Sternberg, Science 153 (1966) 652), we asked...

متن کامل

Graph Structure and Recursive Estimation of Noisy Linear Relations

This paper examines estimation problems speci ed by noisy linear relations describing either dynamical models or measurements. Each such problem has a graph structure, which can be exploited to derive recursive estimation algorithms only when the graph is acyclic, i.e., when it is obtained by combining disjoint trees. Aggregation techniques appropriate for reducing an arbitrary graph to an acyc...

متن کامل

Recognizing Noisy Romanized Japanese Words in Learner English

This paper describes a method for recognizing romanized Japanese words in learner English. They become noise and problematic in a variety of tasks including Part-Of-Speech tagging, spell checking, and error detection because they are mostly unknown words. A problem one encounters when recognizing romanized Japanese words in learner English is that the spelling rules of romanized Japanese words ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2005

ISSN: 0024-3795

DOI: 10.1016/j.laa.2004.12.023